A Communication Lower Bounds Using Directional Derivatives ALEXANDER A. SHERSTOV, University of California, Los Angeles We study the set disjointness problem in the most powerful model of bounded-error communication, the

Source URL: www.cs.ucla.edu

• Quantum complexity theory
• Multiparty communication complexity
• Communication complexity
• PP
• Forcing
• Circuit complexity
• Theoretical computer science
• Applied mathematics
• Computational complexity theory

Multiparty Computation for Interval, Equality, and Comparison without Bit-Decomposition Protocol Takashi Nishide1,2 and Kazuo Ohta1 1

Source URL: www.iacr.org

• Cryptographic protocols
• Secure multi-party computation
• IP
• Communication complexity
• Communications protocol
• FO
• Theoretical computer science
• Applied mathematics
• Cryptography

[removed]The Hales–Jewett Theorem[removed]Many players: the matrix product problem One of the highest known lower

Source URL: lovelace.thi.informatik.uni-frankfurt.de

Cell-Probe Lower Bounds for the Partial Match Problem T.S. Jayram∗ Subhash Khot† Ravi Kumar∗

Source URL: www.cs.technion.ac.il

• Computational complexity theory
• Quantum complexity theory
• Communication
• Communication complexity
• Quantum information science
• Multiparty communication complexity
• Randomized algorithm
• Nearest neighbor search
• Pseudorandom generator
• Theoretical computer science
• Applied mathematics
• Mathematics